Pairwise‎ ‎non-commuting elements in finite metacyclic $2$-groups and some finite $p$-groups

pairwise‎ ‎non-commuting elements in finite metacyclic $2$-groups and some finite $p$-groups

let $g$ be a finite group‎. ‎a subset $x$ of $g$ is a set of pairwise non-commuting elements‎ ‎if any two distinct elements of $x$ do not commute‎. ‎in this paper‎ ‎we determine the maximum size of these subsets in any finite‎ ‎non-abelian metacyclic $2$-group and in any finite non-abelian $p$-group with an abelian maximal subgroup‎.

Maximal subsets of pairwise non-commuting elements of some finite p-groups

Let G be a group. A subset X of G is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in X. If |X| ≥ |Y | for any other set of pairwise non-commuting elements Y in G, then X is said to be a maximal subset of pairwise non-commuting elements. In this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...

maximal subsets of pairwise non-commuting elements of some finite p-groups

let g be a group. a subset x of g is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in x. if |x| ≥ |y | for any other set of pairwise non-commuting elements y in g, then x is said to be a maximal subset of pairwise non-commuting elements. in this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...

commuting and non -commuting graphs of finit groups

فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...

Finite Groups With a Certain Number of Elements Pairwise Generating a Non-Nilpotent Subgroup

Relative n-th non-commuting graphs of finite groups

‎Suppose $n$ is a fixed positive integer‎. ‎We introduce the relative n-th non-commuting graph $Gamma^{n} _{H,G}$‎, ‎associated to the non-abelian subgroup $H$ of group $G$‎. ‎The vertex set is $Gsetminus C^n_{H,G}$ in which $C^n_{H,G} = {xin G‎ : ‎[x,y^{n}]=1 mbox{~and~} [x^{n},y]=1mbox{~for~all~} yin H}$‎. ‎Moreover‎, ‎${x,y}$ is an edge if $x$ or $y$ belong to $H$ and $xy^{n}eq y^{n}x$ or $x...